LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE
نویسندگان
چکیده
منابع مشابه
Improved Resolution Lower Bounds for the Weak Pigeonhole Principle
Recently, Raz Raz01] established exponential lower bounds on the size of resolution proofs of the weak pigeonhole principle. We give another proof of this result which leads to better numerical bounds.
متن کاملLower Bounds for the Weak Pigeonhole Principle Beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conjunctions. We prove that the weak pigeonhole principle and random unsatisfiable CNF formulas require exponential-size proofs in this system. This is the strongest system beyond Resolution for which such lower bounds are ...
متن کاملResolution lower bounds for the weak functional pigeonhole principle
We show that every resolution proof of the functional version FPHPm n of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp ( Ω ( n (logm)2 )) . This implies an exp ( Ω(n1/3) ) bound when the number of pigeons m is arbitrary.
متن کاملP != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length fl(2 ), (for a constant e = 1/3). One corollary is that certain propositional formulations of the statement P / NP do not have s...
متن کامل$P \ne NP$, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle
Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n ǫ ), (for a constant ǫ = 1/3). One corollary is that certain propositional formulations of the statement P 6= NP do not hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2015
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2014.56